Separation Properties for Graph-Directed Self-Similar Fractals
نویسندگان
چکیده
Examples of “separation properties” for iterated function systems of similitudes include: the open set condition, the weak separation property, finite type. Alternate descriptions for these properties and relations among these properties have been worked out. Here we consider the same situation for “graph-directed” iterated function systems, and provide the definitions and proofs for that setting. We deal with the case of strongly connected graphs. In many cases the definitions (and proofs) are much like the one-node case. But sometimes we have found changes were needed.
منابع مشابه
Self-similar fractals and arithmetic dynamics
The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a finite and disjoint union of `similar' copies. Fractals provide a framework in which, one can unite some results and conjectures in Diophantine g...
متن کاملGreen Functions on Self–Similar Graphs and Bounds for the Spectrum of the Laplacian
Combining the study of the simple random walk on graphs, generating functions (especially Green functions), complex dynamics and general complex analysis we introduce a new method of spectral analysis on self-similar graphs. We give an axiomatic definition of self-similar graphs which correspond to general nested but not necessarily finitely ramified fractals. For this class of graphs a graph t...
متن کاملDecidability on Dube's Self-similar Fractals
Dube proved some undecidability on self-affine fractals. In this paper, we obtain the decidability for self-similar fractal of Dube’s type. In fact, we prove that the following problems are decidable to test if the Hausdorff dimension of a given Dube’s self-similar set is equal to its similarity dimension, and to test if a given Dube’s self-similar set satisfies the strong separation condition.
متن کاملFe b 20 02 GROWTH OF SELF - SIMILAR GRAPHS
Geometric properties of self-similar graphs concerning their volume growth and distances in certain finite subgraphs are discussed. The length scaling factor ν and the volume scaling factor µ can be defined similarly to the corresponding parameters of continuous self-similar sets. There are different notions of growth dimensions of graphs. For a rather general class of self-similar graphs it is...
متن کاملAnalyzing Self-Similar and Fractal Properties of the C. elegans Neural Network
The brain is one of the most studied and highly complex systems in the biological world. While much research has concentrated on studying the brain directly, our focus is the structure of the brain itself: at its core an interconnected network of nodes (neurons). A better understanding of the structural connectivity of the brain should elucidate some of its functional properties. In this paper ...
متن کامل